Approximation-based Tree Regular Model-Checking

نویسندگان

  • Yohan Boichut
  • Pierre-Cyrille Héam
  • Olga Kouchnarenko
چکیده

This paper addresses the following general problem of tree regular model-checking: decide whether R * (L) ∩ L p = ∅ where R * is the reflexive and transitive closure of a successor relation induced by a term rewriting system R, and L and L p are both regular tree languages. We develop an automatic approximation-based technique to handle this – undecidable in general – problem in most practical cases, extending a recent work by Feuillade, Genet and Viet Triem Tong. We also make this approach fully automatic for practical validation of security protocols.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Program analysis and specialisation using tree automata

Static analysis of programs using regular tree grammars has been studied for more than 30 years, the earliest example being Reynolds’ work on automatic derivation of data-type definitions from untyped functional programs. Recently the topic has attracted renewed attention, with applications in program specialisation, data flow analysis, shape analysis, mode and type inference, termination analy...

متن کامل

Cut - offs and Automata in Formal Verification of Infinite - State Systems Habilitation

In this habilitation thesis, we discuss two complementary approaches to formal verification of infinite-state systems—namely, the use cut-offs and automata-based symbolic model checking (especially the so-called regular model checking). The thesis is based on extended versions of multiple conference and journal papers joint into a unified framework and accompanied with a significantly extended ...

متن کامل

Probabilistic regular graphs

Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph grammars by probabilities. Stochastic properties of these graphs are expressed using PCTL, a probabilistic extension of computation tree logic. ...

متن کامل

Verification of Programs with Complex Data

In this thesis, we discuss methods of model checking of infinite-state space systems based on symbolic verification—in particular, we concentrate on the use of the so-called regular tree model checking. As a part of our original contribution, we first present abstract regular tree model checking (ARTMC), a technique based on a combination of regular tree model checking with an automated abstrac...

متن کامل

Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata

We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata. We have implemented these algorithms in a prototype tool and we present experiments which show that the algorithms provide a significant improvement over the traditional determinisationbased approaches. Furthermore, we use the proposed antichain-based inclusion checking algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Nord. J. Comput.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2008